Incremental approaches to knowledge reduction of covering decision information systems with variations of coverings
نویسنده
چکیده
In practical situations, calculating approximations of concepts is the central step for knowledge reduction of dynamic covering decision information system, which has received growing interests of researchers in recent years. In this paper, the second and sixth lower and upper approximations of sets in dynamic covering information systems with variations of coverings are computed from the perspective of matrix using incremental approaches. Especially, effective algorithms are designed for calculating the second and sixth lower and upper approximations of sets in dynamic covering information systems with the immigration of coverings. Experimental results demonstrate that the designed algorithms provide an efficient and effective method for constructing the second and sixth lower and upper approximations of sets in dynamic covering information systems. Two examples are explored to illustrate the process of knowledge reduction of dynamic covering decision information systems with the covering immigration.
منابع مشابه
Knowledge reduction of dynamic covering decision information systems with varying attribute values
Knowledge reduction of dynamic covering information systems involves with the time in practical situations. In this paper, we provide incremental approaches to computing the type-1 and type-2 characteristic matrices of dynamic coverings because of varying attribute values. Then we present incremental algorithms of constructing the second and sixth approximations of sets by using characteristic ...
متن کاملKnowledge reduction of dynamic covering decision information systems with immigration of more objects
In practical situations, it is of interest to investigate computing approximations of sets as an important step of knowledge reduction of dynamic covering decision information systems. In this paper, we present incremental approaches to computing the type-1 and type-2 characteristic matrices of dynamic coverings whose cardinalities increase with immigration of more objects. We also present the ...
متن کاملThe construction of characteristic matrixes of dynamic coverings using an incremental approach
The covering approximation space evolves in time due to the explosion of the information, and the characteristic matrixes of coverings viewed as an effective approach to approximating the concept should update with time for knowledge discovery. This paper further investigates the construction of characteristic matrixes without running the matrix acquisition algorithm repeatedly. First, we prese...
متن کاملApplication of Rough Set Theory in Data Mining for Decision Support Systems (DSSs)
Decision support systems (DSSs) are prevalent information systems for decision making in many competitive business environments. In a DSS, decision making process is intimately related to some factors which determine the quality of information systems and their related products. Traditional approaches to data analysis usually cannot be implemented in sophisticated Companies, where managers ne...
متن کاملA New Approach for Knowledge Based Systems Reduction using Rough Sets Theory (RESEARCH NOTE)
Problem of knowledge analysis for decision support system is the most difficult task of information systems. This paper presents a new approach based on notions of mathematical theory of Rough Sets to solve this problem. Using these concepts a systematic approach has been developed to reduce the size of decision database and extract reduced rules set from vague and uncertain data. The method ha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1512.02723 شماره
صفحات -
تاریخ انتشار 2015